Min-max theorem

Results: 43



#Item
31JN[removed]Flow in transport networks 2  3

JN[removed]Flow in transport networks 2 3

Add to Reading List

Source URL: www.jn.inf.ethz.ch

Language: English - Date: 2006-05-18 12:16:21
32Approximation and Hardness Results for Label Cut and Related Problems Peng Zhang ∗

Approximation and Hardness Results for Label Cut and Related Problems Peng Zhang ∗

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2008-02-10 09:20:05
33A normalization strategy for comparing tag count data

A normalization strategy for comparing tag count data

Add to Reading List

Source URL: www.ncbi.nlm.nih.gov

Language: English
34An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations Jonathan A. Kelner

An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations Jonathan A. Kelner

Add to Reading List

Source URL: math.mit.edu

Language: English - Date: 2013-04-08 19:53:37
35On the Separation of Channel and Network Coding in Aref Networks Niranjan Ratnakar

On the Separation of Channel and Network Coding in Aref Networks Niranjan Ratnakar

Add to Reading List

Source URL: www.ifp.illinois.edu

Language: English - Date: 2005-06-29 17:06:05
36The decay of solutions of the heat equation, Campanato’s lemma, and Morrey’s Lemma

The decay of solutions of the heat equation, Campanato’s lemma, and Morrey’s Lemma

Add to Reading List

Source URL: ocw.mit.edu

Language: English - Date: 2013-09-29 07:08:40
37IRE  1956

IRE 1956

Add to Reading List

Source URL: www.ece.rice.edu

Language: English - Date: 2005-04-25 15:54:19
38A Simple Min-Cut Algorithm MECHTHILD STOER Televerkets Forskningsinstitutt, Kjeller, Norway

A Simple Min-Cut Algorithm MECHTHILD STOER Televerkets Forskningsinstitutt, Kjeller, Norway

Add to Reading List

Source URL: www.cs.dartmouth.edu

Language: English - Date: 2005-01-20 14:41:23
39Chapter 10: Network Flow Programming Linear programming, that amazingly useful technique, is about to resurface: many network problems are actually just special forms of linear programs! This includes, for example:

Chapter 10: Network Flow Programming Linear programming, that amazingly useful technique, is about to resurface: many network problems are actually just special forms of linear programs! This includes, for example:

Add to Reading List

Source URL: www.sce.carleton.ca

Language: English - Date: 2012-10-22 11:02:20
40Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs Paul Christiano

Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs Paul Christiano

Add to Reading List

Source URL: math.mit.edu

Language: English - Date: 2010-10-19 15:39:13